Heterogeneous Hardware-Software System Partitioning using Extended Directed Acyclic Graph
نویسندگان
چکیده
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence dependencies simultaneously in one graph representation DADGP, which is an extension of Directed Acyclic Graph (DAG). The DADGP (Directed Acyclic Data dependency Graph with Precedence) based partitioning technique minimizes the communication overhead as well as overall system execution time under real-time deadline. It also tries to minimize the cost of target system in terms of hardware area.
منابع مشابه
Application Analysis and Resource Mapping for Heterogeneous Network Processor Architectures
Network processors use increasingly heterogeneous processing resources to meet demands in performance and flexibility. These general-purpose processors, coprocessors, and hardware accelerators pose a challenge to the software developer as application components need to be mapped to the appropriate resource for optimal performance. To simplify this task, we provide a methodology to automatically...
متن کاملBulgarian Academy of Sciences
The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed scheduling algorithm takes into consideration only one bus fault in multi-bus heterogeneous architectures, caused by hardware faults and compensated by software redundancy solutions. The proposed algorithm is based on both active and passive backup copies, to minimize the schedulin...
متن کاملA Static Scheduling Heuristic for Heterogeneous Processors
17 SCHEDULING AND LOAD BALANCING This paper presented a static scheduling heuristic called best-imaginary-level(BIL) scheduling for heterogeneous processors. The input graph is an acyclic precedence graph, where a node has diierent execution times on diierent processors. The static level of a node, or BIL, incorporates the eeect of interprocessor communication (IPC) overhead and processor heter...
متن کاملComparing Three Heuristic Search Methods for Functional Partitioning in Hardware-Software Codesign
This paper compares three heuristic search algorithms: genetic algorithm (GA), simulated annealing (SA) and tabu search (TS), for hardware-software partitioning. The algorithms operate on functional blocks for designs represented as directed acyclic graphs, with the objective of minimising processing time under various hardware area constraints. The comparison involves a model for calculating p...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کامل